Hash-based signature revisited

Hash-based Digital Signature Schemes

High Performance of Hash-based Signature Schemes

Hash-based signature schemes, whose security is based on properties of the underlying hash functions, are promising candidates to be quantum-safe digital signatures schemes. In this work, we present a software implementation of two recent standard proposals for hash-based signature schemes, Leighton and Micali Signature (LMS) scheme and Extended Merkle Signature Scheme (XMSS), using a set of AV...

Biometric Identity Based Signature Revisited

In this paper, we describe a new biometric Identity Based Signature (IBS) scheme based on the Sakai Kasahara Key Construction and prove its security in the framework of a stronger security model compared to exisiting adversarial models. Besides, we present a new type of a denial of service (DoS) attack and evaluate existing biometric IBS schemes in this context. Based on the recently defined pr...

Leftover Hash Lemma, Revisited

The famous Leftover Hash Lemma (LHL) states that (almost) universal hash functions are good randomness extractors. Despite its numerous applications, LHL-based extractors suffer from the following two limitations: – Large Entropy Loss: to extract v bits from distribution X of minentropy m which are ε-close to uniform, one must set v ≤ m − 2 log (1/ε), meaning that the entropy loss L def = m − v...

Galindo-Garcia Identity-Based Signature Revisited

In Africacrypt 2009, Galindo-Garcia [11] proposed a lightweight identity-based signature (IBS) scheme based on the Schnorr signature. The construction is simple and claimed to be the most efficient IBS till date. The security is based on the discrete-log assumption and the security argument consists of two reductions: B1 and B2, both of which use the multiple-forking lemma [4] to solve the disc...